package jzoffer;

/**
 * @author MaoLin Wang
 * @description
 * @date 2020-08-24 10:56
 */
public class Fib {
    public int fib(int n) {
        if (n==0 || n==1){
            return n;
        }
        int[] dp = new int[n+1];
        dp[0]=0;
        dp[1]=1;
        for (int i = 2; i <n; i++) {
            dp[i]=dp[i-1]+dp[i-2];
            dp[i]%=1000000007;
        }
        return dp[n];
    }

    public static void main(String[] args) {
        Fib fib = new Fib();
        int fib1 = fib.fib(41);
        System.out.println(fib1);
    }
}
